---

Fully Generalized 2D Constrained Delaunay Mesh Refinement: Revisited

 

Panagiotis Foteinos, Andrey Chernikov and Nikos Chrisochoides.

 

Published in SIAM Journal on Scientific Computing, Volume 32, No. 5, pages 2659 -- 2686, August, 2010

 

Abstract

 

Traditional refinement algorithms insert a Steiner point from a few possible choices at each step. Our algorithm, on the contrary, defines regions from where a Steiner point can be selected and thus inserts a Steiner point among an infinite number of choices. Our algorithm significantly extends existing generalized algorithms by increasing the number and the size of these regions. The lower bound for newly created angles can be as high as 26.56 degrees with grading guarantees. This corrects a rather optimistic bound we had in a previous publication [12].